- data locality
- локальность данныхпространственная (spatial locality) или временная (temporal locality) сосредоточенность данных
Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. . 1998-2007.
data locality
Смотреть что такое "data locality" в других словарях:
Locality of reference — In computer science, locality of reference, also known as the principle of locality, is the phenomenon of the same value or related storage locations being frequently accessed. There are two basic types of reference locality. Temporal locality… … Wikipedia
Locality sensitive hashing — (LSH) is a method of performing probabilistic dimension reduction of high dimensional data. The basic idea is to hash the input items so that similar items are mapped to the same buckets with high probability (the number of buckets being much… … Wikipedia
Locality — is a term associated with a place or Location (geography) but may also refer to: * Locality of reference in computer science, which describes how programs typically access data * Principle of locality in physics * Locality (statistics) in… … Wikipedia
Locality (statistics) — In statistics, locality is central tendency of a data set. More frequently, the word location is used. Thus the mean and median are measures of locality. This usage is frequent in exploratory data analysis.The word location also denotes a… … Wikipedia
Data haven — A data haven, like a corporate haven or tax haven, is a refuge for uninterrupted or unregulated data.[1][2][3] Data havens are locations with legal environments that are friendly to the concept of a computer network freely holding data and even… … Wikipedia
Compiler optimization — is the process of tuning the output of a compiler to minimize or maximize some attributes of an executable computer program. The most common requirement is to minimize the time taken to execute a program; a less common one is to minimize the… … Wikipedia
Stream processing — is a computer programming paradigm, related to SIMD, that allows some applications to more easily exploit a limited form of parallel processing. Such applications can use multiple computational units, such as the floating point units on a GPU,… … Wikipedia
Frameworks supporting the polyhedral model — Use of the polyhedral model within a compiler requires software to represent the objects of this framework (sets of integer valued points in regions of various spaces) and perform operations upon them (e.g., testing whether the set is empty). Two … Wikipedia
Database caching — Many applications today are being developed and deployed on multi tier environments that involve browser based clients, web application servers and backend databases. These applications need to generate web pages on demand by talking to backend… … Wikipedia
OpenMP — Original author(s) OpenMP Architecture Review Board[1] Developer(s) OpenMP Architecture Review Board … Wikipedia
Red-black tree — A red black tree is a type of self balancing binary search tree, a data structure used in computer science, typically used to implement associative arrays. The original structure was invented in 1972 by Rudolf Bayer who called them symmetric… … Wikipedia
